Role Ordering (RO) Scheduler for Distributed Objects

A Distributed Maximal Scheduler for Strong Fairness

Weak fairness guarantees that continuously enabled actions are executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are enabled infinitely often (but not necessarily continuously) are executed infinitely often. In this paper, we present a distributed algorithm for scheduling actions for execution. Assuming weak fairness for the execution of this algorithm,...

An Effective Approach for Distributed Meeting Scheduler

Meeting scheduling is generally considered as one of the most common activities that takes place in organizations. It is a distributed, time-consuming, iterative, and also a tedious task. Meeting scheduling is an example of a resource allocation problem. The principal resource considered for meeting scheduling is the persons’ time. The resource requirement in a distributed environment is dynami...

An automated distributed meeting scheduler

Ordering Objects via Attribute Preferences

We apply recent results on the construction of suitable orderings for the existence of right adjoint to the analysis of the following problem: given a preference ordering on the set of attributes of a given context, we seek an induced preference among the objects which is compatible with the information provided by the context.

Concurrency control based on role concept

A Role-Based Access Control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in the presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on ‘first-comer-winner’ and ‘timestamp order’ principles to make multiple conflicting transactions serialisable, respectively. In this pap...